Multiple environment optimal update profiling for steepest descent algorithms
نویسنده
چکیده
In this paper, the methods for use of prior information about multiple operating environments, in improving adaptive filter convergence properties are discussed. More concretely, the gain selection, profiling and scheduling in steepest descent algorithms are treated in detail. Work presented in this paper is an extension of [1]. Two flavors of optimization are discussed: average descent rate optimization and maximization of the minimum descent rate. It is demonstrated, just as in the case of single channel optimization, with no additional complexity a substantial increase of convergence rate of steepest descent algorithms can be achieved. Finally, performance of the method is analyzed on the adaptive linear equalizer design for local area networks.
منابع مشابه
Residual norm steepest descent based iterative algorithms for Sylvester tensor equations
Consider the following consistent Sylvester tensor equation[mathscr{X}times_1 A +mathscr{X}times_2 B+mathscr{X}times_3 C=mathscr{D},]where the matrices $A,B, C$ and the tensor $mathscr{D}$ are given and $mathscr{X}$ is the unknown tensor. The current paper concerns with examining a simple and neat framework for accelerating the speed of convergence of the gradient-based iterative algorithm and ...
متن کاملA Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems
In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...
متن کاملAdaptive algorithms for Weighted Myriad Filter optimization
Stochastic gradient-based adaptive algorithms are developed for the optimization of Weighted Myriad Filters, a class of nonlinear lters, motivated by the properties of -stable distributions, that have been proposed for robust non-Gaussian signal processing in impulsive noise environments. An implicit formulation of the lter output is used to derive an expression for the gradient of the mean abs...
متن کاملFirst Order Generative Adversarial Networks
GANs excel at learning high dimensional distributions, but they can update generator parameters in directions that do not correspond to the steepest descent direction of the objective. Prominent examples of problematic update directions include those used in both Goodfellow’s original GAN and the WGAN-GP. To formally describe an optimal update direction, we introduce a theoretical framework whi...
متن کاملVariational Calculus in Space of Measures and Optimal Design
The paper applies abstract optimisation principles in the space of measures within the context of optimal design problems. It is shown that within this framework it is possible to treat various design criteria and constraints in a unified manner providing a “universal” variant of the Kiefer-Wolfowitz theorem and giving a full spectrum of optimality criteria for particular cases. The described s...
متن کامل